Local Consistencies in SAT
نویسندگان
چکیده
We introduce some new mappings of constraint satisfaction problems into propositional satisfiability. These encodings generalize most of the existing encodings. Unit propagation on those encodings is the same as establishing relational k-arc consistency on the original problem. They can also be used to establish (i,j)-consistency on binary constraints. Experiments show that these encodings are an effective method for enforcing such consistencies, that can lead to a reduction in runtimes at the phase transition in most cases. Compared to the more traditional (direct) encoding, the search tree can be greatly pruned.
منابع مشابه
Local Consistency in Weighted CSPs and Inference in Max-SAT
In this paper we overview our recent work and outline our current line of research: First, we describe the WCSP framework and its related local consistencies. Second, the Max-SAT problem and some related inference rules including a new rule that is an extension of the classical Modus Ponens. Finally, we will show the relation between both ideas and how this link can help us to improve existent ...
متن کاملLookahead in Smodels Compared to Local Consistencies in CSP
In answer set programming systems like Smodels and some SAT solvers, constraint propagation is carried out by a mechanism called lookahead. The question arises as what is the pruning power of lookahead, and how such pruning power fares in comparison with the consistency techniques in solving CSPs. In this paper, we study the pruning power of lookahead by relating it to local consistencies under...
متن کاملTractability-preserving transformations of global cost functions
Graphical model processing is a central problem in artificial intelligence. The optimization of the combined cost of a network of local cost functions federates a variety of famous problems including CSP, SAT and Max-SAT but also optimization in stochastic variants such as Markov Random Fields and Bayesian networks. Exact solving methods for these problems typically include branch and bound and...
متن کاملDomain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local consistency properties. This is in contrast with binary constraints where numerous such domain filtering consistencies have been proposed. In this paper we present a detailed theoretical, algorithmic a...
متن کاملA Framework for Decision-Based Consistencies
Consistencies are properties of constraint networks that can be enforced by appropriate algorithms to reduce the size of the search space to be explored. Recently, many consistencies built upon taking decisions (most often, variable assignments) and stronger than (generalized) arc consistency have been introduced. In this paper, our ambition is to present a clear picture of decision-based consi...
متن کامل